Training quantum embedding kernels on near-term quantum computers
نویسندگان
چکیده
Kernel methods are a cornerstone of classical machine learning. The idea using quantum computers to compute kernels has recently attracted attention. Quantum embedding (QEKs), constructed by data into the Hilbert space computer, particular kernel technique that is particularly suitable for noisy intermediate-scale devices. Unfortunately, face three major problems: Constructing matrix quadratic computational complexity in number training samples, choosing right function nontrivial, and effects noise unknown. In this work, we addressed latter two. particular, introduced notion trainable QEKs, based on model optimization methods. To train parameters QEK, proposed use kernel-target alignment. We verified feasibility method, showed our experimental setup could reduce error significantly. Furthermore, investigated device finite sampling noise, evaluated various mitigation techniques numerically hardware. took best performing strategy it from real processing unit. found demonstrated an increased quality.
منابع مشابه
Opportunities and challenges for quantum-assisted machine learning in near-term quantum computers
Alejandro Perdomo-Ortiz, 2, 3, 4, 5, ∗ Marcello Benedetti, 2, 4, 5 John Realpe-Gómez, 6, 7 and Rupak Biswas 8 Quantum Artificial Intelligence Lab., NASA Ames Research Center, Moffett Field, CA 94035, USA USRA Research Institute for Advanced Computer Science, Mountain View, CA 94043, USA Qubitera, LLC., Mountain View, CA 94041, USA Department of Computer Science, University College London, WC1E ...
متن کاملQuantum Gravity on Computers
Some times Thomas Hardy has been compared to Dostoevski, but Dostoevski is an incomparably ner artist. If Dostoevski's works could be compared to some of say, Rubens' paintings, then Hardy's are neatly nished diagrams drawn on graph paper with ruler and compass! Compare for instance the tragedy to Tess with that of Sonia, or the culmination of the forces in Raskolnikoo's confession with the mel...
متن کاملQuantum Walks, Quantum Gates, and Quantum Computers
The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of the graph. It is shown how to map between quantum walk Hamiltonians and Hamiltonians for qubit systems and quantum circuits; this is done for both a singleand multi-excitation coding, and for more genera...
متن کاملQuantum computers and quantum coherence
If the states of spins in solids can be created, manipulated, and measured at the single-quantum level, an entirely new form of information processing, quantum computing, will be possible. We "rst give an overview of quantum information processing, showing that the famous Shor speedup of integer factoring is just one of a host of important applications for qubits, including cryptography, counte...
متن کاملQuantum Computers
We analyse dissipation in quantum computation and its destructive impact on eeciency of quantum algorithms. We discuss relations between decoherence and computational complexity and show that quantum factorisation algorithm must be modiied in order to be regarded as eecient and realistic. Our model od decoherence is quite general and incorporates reservoirs with a large coherence length.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical review
سال: 2022
ISSN: ['0556-2813', '1538-4497', '1089-490X']
DOI: https://doi.org/10.1103/physreva.106.042431